The Strange Complexity of Constrained Delaunay Triangulation
نویسندگان
چکیده
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
منابع مشابه
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
In this paper, we present an Θ(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane. Up to now, only an O(n logn) worst-case deterministic and an O(n) expected time bound have been shown, leaving an O(n) deterministic solution open to conjecture.
متن کاملMinimal Set of Constraints for 2D Constrained Delaunay Reconstruction
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay triangulation. We show that this minimal set consists of the non locally Delaunay edges of T , and that its cardinality is less than or equal to n+ i=2 (if i is the number of interior points in T )...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملHow To Place a Point to Maximize Angles
We describe a randomized algorithm that, given a set P of points in the plane, computes the best location to insert a new point p, such that the Delaunay triangulation of P ∪ {p} has the largest possible minimum angle. The expected running time of our algorithm is at most cubic, improving the roughly quartic time of the best previously known algorithm. It slows down to slightly super-cubic if w...
متن کاملRestricted Constrained Delaunay Triangulations
We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of t...
متن کامل